On Secrecy Capacity Scaling in Wireless Networks
نویسندگان
چکیده
منابع مشابه
Capacity-Delay Scaling in Arbitrary Wireless Networks
Gupta and Kumar (2000) studied capacity scaling in random wireless networks with n nodes under the protocol interference model. They showed that the per source-destination pair capacity scales as Θ(1/ √ n logn) when n distinct random source-destination pairs communicate simultaneously. For the same setup, El Gamal, Mammen, Prabhakar and Shah (2004) showed that the delay scales as Θ( √ n/ logn)....
متن کاملCapacity scaling in large wireless networks
We consider networks consisting of nodes with radios, and without any wired infrastructure, thus necessitating all communication to take place only over shared wireless medium. We focus mainly on the flat fading channel model. We study capacity scaling laws in such systems when the number of nodes gets large. We show that in extended networks (network with constant density of users) capacity sc...
متن کاملSecrecy Transmission Capacity in Noisy Wireless Ad Hoc Networks
This paper considers the transmission of confidential messages over noisy wireless ad hoc networks, where both background noise and interference from concurrent transmitters affect the received signals. For the random networks where the legitimate nodes and the eavesdroppers are distributed as Poisson point processes, we study the secrecy transmission capacity (STC), as well as the connection o...
متن کاملPerfect Secrecy in Wireless Networks
In a classic paper, among a multitude of other security issues, Claude E. Shannon defined perfect secrecy for a pair of secure computers communicating over an insecure link. The present paper extends Shannon’s notion of perfect secrecy to ad hoc wireless networks of computers. All of the wireless transmissions are insecure. This paper assumes a secure base-station communicating wirelessly using...
متن کاملOn information-theoretic secrecy for wireless networks
In this paper we summarize our recent work on information-theoretically secure wireless relay network communication. In such communication, the goal is to send information between two special nodes (“source” and “destination”) in a (memoryless) network with authenticated relays, where the secrecy is with respect to a class of eavesdroppers. We develop achievable secrecy rates when authenticated...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2012
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2012.2184692